Exploitation of a Rough Approximation of the Outranking Relation in Multicriteria Choice and Ranking

نویسندگان

  • Salvatore Greco
  • Benedetto Matarazzo
  • Roman Slowinski
  • Alexis Tsoukiàs
چکیده

Given a finite set A of actions evaluated by a family of criteria, we consider a preferential information in the form of a pairwise comparison table (PCT) including pairs of actions from a subset B⊆A×A described by graded preference relations on particular criteria and a comprehensive outranking relation. Using the rough set approach to the analysis of the PCT, we obtain a rough approximation of the outranking relation by a graded dominance relation. Decision rules derived from this approximation are then applied to a set M⊆A of potential actions. As a result, we obtain a four-valued outranking relation on set M. The construction of a suitable exploitation procedure in order to obtain a recommendation for multicriteria choice and ranking is an open problem within this context. We propose an exploitation procedure that is the only one satisfying some desirable properties.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple criteria ranking and choice with all compatible minimal cover sets of decision rules

We introduce a new multiple criteria ranking/choice method that applies Dominance-based Rough Set Approach (DRSA) and represents the Decision Maker’s (DM’s) preferences with decision rules. The DM provides a set of pairwise comparisons indicating whether an outranking (weak preference) relation should hold for some pairs of reference alternatives. This preference information is structured using...

متن کامل

Invited Review Rough sets theory for multicriteria decision analysis

The original rough set approach proved to be very useful in dealing with inconsistency problems following from information granulation. It operates on a data table composed of a set U of objects (actions) described by a set Q of attributes. Its basic notions are: indiscernibility relation on U, lower and upper approximation of either a subset or a partition of U, dependence and reduction of att...

متن کامل

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

The integration of valued outranking relations in ELECTRE methods for ranking problem

The ELECTRE family of decision aid methods are well-known approaches in the field of multiple criteria decision aiding (MCDA). Different ELECTRE methods can be used for choice problem, ranking problem and sorting problem respectively. These methods are characterized by outranking relations and exploitation procedures. Different definitions of the outranking relations result in the difference of...

متن کامل

Supplier selection using compromise ranking and outranking methods

In today’s highly competitive manufacturing environment, an effective supplier selection process is very important for the success of any business organization. Selection of the best supplier is always a difficult task for the purchasing manager. Suppliers have varied strengths and weaknesses which require careful assessment by the purchasing manager before selecting and ranking them. Any suppl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003